Constrained Dynamic Tree Networks∗

نویسندگان

  • Matthew Hague
  • Vincent Penelle
چکیده

We generalise Constrained Dynamic Pushdown Networks, introduced by Bouajjani et al., to Constrained Dynamic Tree Networks. In this model, we have trees of processes which may monitor their children. We allow the processes to be defined by any computation model for which the alternating reachability problem is decidable. We address the problem of symbolic reachability analysis for this model. More precisely, we consider the problem of computing an effective representation of their reachability sets using finite state automata. We show that backward reachability sets starting from regular sets of configurations are always regular. We provide an algorithm for computing backward reachability sets using tree automata.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Design of Instrumentation Sensor Networks for Non-Linear Dynamic Processes Using Extended Kalman Filter

This paper presents a methodology for design of instrumentation sensor networks in non-linear chemical plants. The method utilizes a robust extended Kalman filter approach to provide an efficient dynamic data reconciliation. A weighted objective function has been introduced to enable the designer to incorporate each individual process variable with its own operational importance. To enhance...

متن کامل

Static and dynamic graph algorithms with applications to infrastructure and content management of modern networks

This dissertation focuses on networks primarily used for the dissemination of content. We model these networks using graph theory and study algorithms for the replication of content as well as for their infrastructure. In terms of infrastructure, we propose the first fully dynamic algorithm for maintaing a minimum spanning tree on a directed graph. In terms of content replication and focusing o...

متن کامل

Towards More E cient Inference in Dynamic Bayesian Networks

The constrained node elimination (CNE) method is a method explicitly designed for exact inference in dynamic Bayesian networks (DBNs). It is suuciently eeective for applications where the dynamic domains evolve relatively slowly, but is reported to be \too expensive" for some fast evolving domain, e.g., the BATmobile, where the inference computation is under time pressure. This research applies...

متن کامل

Bayes Networks and Fault Tree Analysis Application in Reliability Estimation (Case Study: Automatic Water Sprinkler System)

In this study, the application of Bayes networks and fault tree analysis in reliability estimation have been investigated. Fault tree analysis is one of the most widely used methods for estimating reliability. In recent years, a method called "Bayes Network" has been used, which is a dynamic method, and information about the probable failure of the system components will be updated according to...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2016